Kinetic Euclidean minimum spanning tree in the plane
نویسندگان
چکیده
منابع مشابه
Maintaining a Minimum Spanning Tree for Kinetic Autonomous Robots in 2D-Euclidean Plane
This paper presents a procedure for maintaining a 2D-Euclidean Minimum Spanning Tree for a set of n autonomous kinetic robots having no central supervision. The proposed procedure is based on the Kinetic data structure framework and the well known fact that the edges of the minimum spanning tree for a given set of points in the 2D-Euclidean domain are contained in the edges of its Delaunay tria...
متن کاملOn the Euclidean Minimum Spanning Tree Problem∗
Given a weighted graph G(V,E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between the two points. Finding a minimum spanning...
متن کاملCombinatorial changes of euclidean minimum spanning tree of moving points in the plane
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that the motion of the points in the plane, is defined by algebraic functions of maximum degree s of time. We prove an upper bound of O(nβ2s(n )) for the number of the combinatorial changes of the EMST, where βs(n)=λs(n)/n...
متن کامل4 Minimum Spanning Tree
This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...
متن کاملApproximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of points in . We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.04.009